The Casimir effect for parallel plates at finite temperature in the presence of one fractal extra compactified dimension

We discuss the Casimir effect for massless scalar fields subject to the Dirichlet boundary conditions on the parallel plates at finite temperature in the presence of one fractal extra compactified dimension. We obtain the Casimir energy density with the help of the regularization of multiple zeta function with one arbitrary exponent and further the renormalized Casimir energy density involving the thermal corrections. It is found that when the temperature is sufficiently high, the sign of the Casimir energy remains negative no matter how great the scale dimension $\delta$ is within its allowed region. We derive and calculate the Casimir force between the parallel plates affected by the fractal additional compactified dimension and surrounding temperature. The stronger thermal influence leads the force to be stronger. The nature of the Casimir force keeps attractive.Comment: 14 pages, 2 figure

Light Front Approach for Strong and Weak Decays of Pentaquarks

Strong and weak decays of pentaquarks are studied in the framework of the light-front approach.Comment: 3 pages, talk given at the 2004 DPF Meeting, Riverside, CA. Aug 26-31, 200

Dynamic response and stability of a gas-lubricated Rayleigh-step pad

The quasi-static, pressure characteristics of a gas-lubricated thrust bearing with shrouded, Rayleigh-step pads are determined for a time-varying film thickness. The axial response of the thrust bearing to an axial forcing function or an axial rotor disturbance is investigated by treating the gas film as a spring having nonlinear restoring and damping forces. These forces are related to the film thickness by a power relation. The nonlinear equation of motion in the axial mode is solved by the Ritz-Galerkin method as well as the direct, numerical integration. Results of the nonlinear response by both methods are compared with the response based on the linearized equation. Further, the gas-film instability of an infinitely wide Rayleigh step thrust pad is determined by solving the transient Reynolds equation coupled with the equation of the motion of the pad. Results show that the Rayleigh-step geometry is very stable for bearing number A up to 50. The stability threshold is shown to exist only for ultrahigh values of Lambda equal to or greater than 100, where the stability can be achieved by making the mass heavier than the critical mass

Genetic algorithms with elitism-based immigrants for dynamic shortest path problem in mobile ad hoc networks

This article is posted here with permission from the IEEE - Copyright @ 2009 IEEEIn recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks (ANNs), genetic algorithms (GAs), particle swarm optimization (PSO), etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile ad hoc network (MANET), wireless sensor network (WSN), etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, that is, the network topology changes over time due to energy conservation or node mobility. Therefore, the SP problem turns out to be a dynamic optimization problem (DOP) in MANETs. In this paper, we propose to use elitism-based immigrants GA (EIGA) to solve the dynamic SP problem in MANETs. We consider MANETs as target systems because they represent new generation wireless networks. The experimental results show that the EIGA can quickly adapt to the environmental changes (i.e., the network topology change) and produce good solutions after each change.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1

Joint multicast routing and channel assignment in multiradio multichannel wireless mesh networks using tabu search

Copyright @ 2009 IEEE Computer SocietyThis paper proposes a tabu search (TS) based optimization approach to search a minimum-interference multicast tree which satisfies the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. The path-oriented encoding method is adopted and each candidate solution is represented by a tree data structure (i.e., a set of paths). Since we expect the multicast trees on which the minimum-interference channel assignment can be produced, a fitness function that returns the total channel conflict is devised. The techniques for controlling the tabu search procedure are well developed. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed TS multicast algorithm can produce the multicast trees which have better performance in terms of both the total channel conflict and the tree cost than that of a well known multicast algorithm in wireless mesh networks.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1

A genetic-inspired joint multicast routing and channel assignment algorithm in wireless mesh networks

Copyright @ 2008 IEEEThis paper proposes a genetic algorithm (GA) based optimization approach to search a minimum-interference multicast tree which satis¯es the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. The path-oriented en- coding method is used and each chromosome is represented by a tree data structure (i.e., a set of paths). Since we expect the multicast trees on which the minimum-interference channel assignment can be produced, a fitness function that returns the total channel conflict is devised. Crossover and mutation are well designed to adapt to the tree structure. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed GA based multicast algorithm achieves better performance in terms of both the total channel conflict and the tree cost than that of a well known algorithm

Copying equations to assess mathematical competence: An evaluation of pause measures using graphical protocol analysis

Can mathematical competence be measured by analyzing the patterns of pauses between written elements in the freehand copying of mathematical equations? Twenty participants of varying levels of mathematical competence copied sets of equations and sequences of numbers on a graphics tablet. The third quartile of pauses is an effective measure, because it re- flects the greater number of chunks and the longer time spent per chunk by novices as they processed the equations. To compensate for individual differences in speeds of elementary operations and skill in writing basic mathematical symbols, variants on the measure were devised and tested

Genetic algorithms with elitism-based immigrants for dynamic load balanced clustering problem in mobile ad hoc networks

This article is posted here with permission of IEEE - Copyright @ 2011 IEEEIn recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile networks [mobile ad hoc networks (MANETs)], wireless sensor networks, etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, i.e., the network topology changes over time due to energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to be a dynamic optimization problem. In this paper, we propose to use GAs with immigrants and memory schemes to solve the dynamic SP routing problem in MANETs. We consider MANETs as target systems because they represent new-generation wireless networks. The experimental results show that these immigrants and memory-based GAs can quickly adapt to environmental changes (i.e., the network topology changes) and produce high-quality solutions after each change.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1 and Grant EP/E060722/2